A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes
نویسندگان
چکیده
منابع مشابه
A Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block Codes
Soft-input/soft-output symbol decoding plays a significant role in iterative decoding. We propose a simple optimal soft-input/softoutput symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et al. [1], and the decrease is shown at its most when d...
متن کاملA Simple One Sweep Algorithm for Optimal
| Soft-input/soft-output symbol decoding plays a signiicant role in iterative decoding. We propose a simple optimal soft-input/soft-output symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et. al. 1], and the decrease is shown at its most when...
متن کاملAn Optimal Two-Stage Decoding Algorithm for Linear Block Codes
A new optimal two stages decoding algorithm for linear block codes is presented. At first stage, the minimum sufficient test set Ŝ is estimated. With the minimum sufficient test set, decoding complexity can be greatly reduced while maintaining the optimal performance. At the second stage, ordered processing is performed over the estimated minimum sufficient test set Ŝ to find the optimal soluti...
متن کاملOptimal Decoding of Linear Codes for Minimizing Symbol
The previous are identical to the expressions (2) and (3). Thus the n 1 columns do consist of two repetitions of 2”-r-level Gray code. Now if we combine the first two columns again, we reduce each 2”-‘-level Gray code into two 2n-2-level Gray codes, or, the complete array into four 2”-2-level Gray codes. This can continue until we have only m columns, which would be 2n-m repetitions of 2”‘-leve...
متن کاملAn optimum symbol-by-symbol decoding rule for linear codes
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1998
ISSN: 0018-9448
DOI: 10.1109/18.737541